Formal parametric polymorphism
نویسندگان
چکیده
منابع مشابه
Parametric Polymorphism - Universally
In the 1980s, John Reynolds postulated that a parametrically polymorphic function is an ad-hoc polymorphic function satisfying a uniformity principle. This allowed him to prove that his set-theoretic semantics has a relational lifting which satisfies the Identity Extension Lemma and the Abstraction Theorem. However, his definition (and subsequent variants) have only been given for specific mode...
متن کاملCombining Inclusion Polymorphism and Parametric Polymorphism
We show that the question whether a term is typable is decidable for type systems combining inclusion polymorphism with parametric polymorphism provided the type constructors are at most unary. To prove this result we first reduce the typability problem to the problem of solving a system of type inequations. The result is then obtained by showing that the solvability of the resulting system of ...
متن کاملA Model for Formal Parametric Polymorphism: A PER Interpretation for System R
System R is an extension of system F that formalizes Reynolds' notion of relational parametricity. In system R, considerably more-terms can be proved equal than in system F : for example, the encoded weak products of F are strong products in R. Also, many \theorems for free" a la Wadler can be proved formally in R. In this paper we describe a semantics for system R. As a rst step, we give a pre...
متن کاملTyped parametric polymorphism for aspects
We study the incorporation of generic types in aspect languages. Since advice acts likemethod update, such a study has to accommodate the subtleties of the interaction of classes,polymorphism and aspects. Indeed, simple examples demonstrate that current aspect com-piling techniques do not avoid runtime type errors.We explore type systems with polymorphism for two models of param...
متن کاملCompiling with Non-Parametric Polymorphism
There is a middle ground between parametric and ad-hoc polymorphism in which a computation can depend upon a type parameter but is restricted to being de ned at all types in an inductive fashion. We call such polymorphism non-parametric. We show how nonparametric polymorphism can be used to implement a variety of useful language mechanisms including overloading, unboxed data representations in ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1993
ISSN: 0304-3975
DOI: 10.1016/0304-3975(93)90082-5